Alternating finite automaton
Results: 12
| # | Item |
|---|---|
11![Checking Finite Traces using Alternating Automata ∗ Bernd Finkbeiner and Henny Sipma Computer Science Department, Stanford University Stanford, CA[removed]Abstract. Alternating automata have been commonly used as a basi](https://www.pdfsearch.io/img/4bf2f41a91c245324485fa08ad87357e.jpg "Checking Finite Traces using Alternating Automata ∗ Bernd Finkbeiner and Henny Sipma Computer Science Department, Stanford University Stanford, CA[removed]Abstract. Alternating automata have been commonly used as a basi") | Checking Finite Traces using Alternating Automata ∗ Bernd Finkbeiner and Henny Sipma Computer Science Department, Stanford University Stanford, CA[removed]Abstract. Alternating automata have been commonly used as a basiAdd to Reading ListSource URL: www.verisoft.deLanguage: English - Date: 2013-04-11 05:48:57 |
12 | Dependency Tree Automata Colin Stirling School of InformaticsAdd to Reading ListSource URL: homepages.inf.ed.ac.ukLanguage: English - Date: 2009-01-05 09:54:02 |